How Vertex reinforced jump process arises naturally
نویسندگان
چکیده
We prove that the only nearest neighbor jump process with local dependence on the occupation times satisfying the partially exchangeable property is the vertex reinforced jump process, under some technical conditions (Theorem 4). This result gives a counterpart to the characterization of edge reinforced random walk given by Rolles [9].
منابع مشابه
9 Limit Theorems for Vertex - Reinforced Jump Processes on Regular Trees
Consider a vertex-reinforced jump process defined on a regular tree, where each vertex has exactly b children, with b ≥ 3. We prove the strong law of large numbers and the central limit theorem for the distance of the process from the root. Notice that it is still unknown if vertex-reinforced jump process is transient on the binary tree. Dipartimento di Matematica applicata, Università Ca’ Fosc...
متن کاملLimit theorems for vertex-reinforced jump processes on regular trees
Consider a vertex-reinforced jump process defined on a regular tree, where each vertex has exactly b children, with b ≥ 3. We prove the strong law of large numbers and the central limit theorem for the distance of the process from the root. Notice that it is still unknown if vertexreinforced jump process is transient on the binary tree.
متن کاملEdge-reinforced random walk, Vertex-Reinforced Jump Process and the supersymmetric hyperbolic sigma model
Edge-reinforced random walk (ERRW), introduced by Coppersmith and Diaconis in 1986 [5], is a random process that takes values in the vertex set of a graph G, which is more likely to cross edges it has visited before. We show that it can be interpreted as an annealed version of the Vertex-reinforced jump process (VRJP), conceived by Werner and first studied by Davis and Volkov [7, 8], a continuo...
متن کاملOn the Transience of Processes Defined on Galton
We introduce a simple technique for proving the transience of certain processes defined on the random tree G generated by a supercritical branching process. We prove the transience for once-reinforced random walks on G, that is, a generalization of a result of Durrett, Kesten and Limic [Probab. Theory Related Fields 122 (2002) 567– 592]. Moreover, we give a new proof for the transience of a fam...
متن کاملHow edge reinforced random walk arises naturally
We give a characterization of a modi ed edge reinforced random walk in terms of certain partially exchangeable sequences In particu lar we obtain a characterization of edge reinforced random walk in troduced by Coppersmith and Diaconis on a edge connected graph Modifying the notion of partial exchangeability introduced by Diaco nis and Freedman in we characterize unique mixtures of reversible M...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017